Diffusion with restrictions
نویسندگان
چکیده
منابع مشابه
Diffusion with Restrictions
A non–linear diffusion equation is derived by taking into account hopping rates depending on the occupation of next neighbouring sites. There appears additonal repulsive and attractive forces leading to a changed local mobiltiy. The stationary and the time dependent behaviour of the system are studied based upon the master equation approach. Different to conventional diffusion it results a time...
متن کاملSorting Algorithms with Restrictions
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors and applied problems with data streams, sorting changed its face. This changes and generalizations are the subject of investigation in the research below.
متن کاملStacked Regression with Restrictions
When we apply stacked regression to classification we need only discriminant indices which can be negative. In many situations, we want these indices to be positive, e.g., if we want to use them to count posterior probabilities, when we want to use stacked regression to combining classification. In such situation, we have to use least squares regression under the constraint βk ≥ 0, k = 1, 2, . ...
متن کاملConfigurations with Subset Restrictions
closed families of sets. Poonen showed that if a finite union-closed family of sets S contains three of the 3−sets in some 4−set, then one of the elements of that 4−set is contained in at least half the members of the family S. This condition intrigued us, and we began to investigate collections of 3−sets for which it fails. The alternative statement that no 4−set contain more than two 3−sets i...
متن کاملClustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let μ be a function on the subsets of vertices of a graph G. In the (μ, p, q)-Partition problem, the task is to find a partition of the vertices into clusters where each cluster C satisfies the requirements that (1) at most q edges leave C and (2) μ(C) ≤ p. Our first result sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 1998
ISSN: 0375-9601
DOI: 10.1016/s0375-9601(98)00335-1